package com.example.algorithm.no0337;

import com.example.algorithm.no0337.impl.ArraySolutionImpl;

/**
 * 解答测试-重建二叉树
 *
 * @author yumuhui
 */
public class SolutionTest {

    public static void main(String[] a1rgs) {

        // root = [3,2,3,null,3,null,1] 7
        TreeNode root = new TreeNode(3,
                new TreeNode(2, null, new TreeNode(3)),
                new TreeNode(3, null, new TreeNode(1)));

//        // root = [3,4,5,1,3,null,1]    9
//        TreeNode root = new TreeNode(3,
//                new TreeNode(4, new TreeNode(1), new TreeNode(3)),
//                new TreeNode(5, null, new TreeNode(1)));

        System.out.println("入参: root: " + root);

        Solution solution = new ArraySolutionImpl();
        int rob = solution.rob(root);

        System.out.println("输出: " + rob);
    }
}
